Efficient and accurate P-value computation for Position Weight Matrices
نویسندگان
چکیده
منابع مشابه
P-value-based regulatory motif discovery using positional weight matrices.
To analyze gene regulatory networks, the sequence-dependent DNA/RNA binding affinities of proteins and noncoding RNAs are crucial. Often, these are deduced from sets of sequences enriched in factor binding sites. Two classes of computational approaches exist. The first describe binding motifs by sequence patterns and search the patterns with highest statistical significance for enrichment. The ...
متن کاملLarge Scale Matching for Position Weight Matrices
This paper addresses the problem of multiple pattern matching for motifs encoded by Position Weight Matrices. We first present an algorithm that uses a multi-index table to preprocess the set of motifs, allowing a dramatically decrease of computation time. We then show how to take benefit from simlar motifs to prevent useless computations.
متن کاملEfficient Exact p -Value Computation and Applications to Biosequence Analysis
Like other fields of life sciences, bioinformatics has turned to capture biological phenomena through probabilistic models, and to analyse these models using statistical methodology. A central computational problem in applying useful statistical procedures such as various hypothesis testing procedures is the computation of p-values. In this paper, we devise a branch and bound approach to effici...
متن کاملValue Compression for Efficient Computation
A processor’s energy consumption can be reduced by compressing values (data and addresses) that flow through a processor pipeline and gating off portions of data path elements that would otherwise be used for computing non-significant bits. An approach for compressing all values running through a processor is proposed and evaluated. For the SpecInt2000 benchmarks the best compression method ach...
متن کاملEfficient Computation of Template Matrices
The computation of template matrices is the bottleneck of simple algorithms for perfect phylogeny haplotyping and for perfect phylogeny under mutation and constrained recombination. The fastest algorithms known so far compute them in O(nm) time. In this paper, we describe an algorithm for computing template matrices in O(nm/ log(n)) time. We also present and discuss a conjecture that implies an...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algorithms for Molecular Biology
سال: 2007
ISSN: 1748-7188
DOI: 10.1186/1748-7188-2-15